An Exact Solution Approach for the Airport Stand Allocation Problem

نویسندگان

  • Rodrigo Acuna-Agost
  • Daniel Perez
  • Julien Guepet
چکیده

Every day planners and dispatcher in airports deal with different decisions related to the movement of aircraft. These decisions usually involve the use of fixed resources like runways, stands (parking positions), and passenger gates. Due to the increasing flow of passengers, these resources are becoming scarce and some airports have experimented a degradation of the services offered. One clear example is the fact that passengers are more and more being allocated to remote stands where a bus transfer is necessary to get to the terminal. This reality not only affects connection times for passengers, but also increases operation costs and decreases airport revenues, e.g., airlines usually pay lower fees when their flights are allocated at remote stands. In this paper we deal with the stand allocation problem. The interested reader is referred to a complete survey of this problem by Dorndorf (2007). Given a set of aircraft operations and available stands, the task is to find the more profitable assignment of aircraft operations to aircraft stands while respecting operational constraints. Aircraft operations refer to scheduling tasks that need to be physically allocated to a parking position, e.g., arrival, departure, or parking operations. Controllers can also decide to tow an aircraft from one stand to another. These towing operations allow a better utilization of valuable stands (e.g., contact stands); but, on the other hand, an expensive towing tractor movement is required. Additionally, the assignments should satisfy a number of constraints, such as the compatibility between operations and stands and the constraints that prevent adjacency conflicts, e.g., two large aircraft cannot be assigned to adjacent stands at the same time. In this paper, an integer programming formulation is presented. Our research involves the development of several solution methodologies including simple greedy algorithms,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)

Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...

متن کامل

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...

متن کامل

A Bi-level Formulation for Centralized Resource Allocation DEA Models

In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

an Optimum Resource Allocation Model for Airport Passenger Terminals (RESEARCH NOTE)

According to the current Airport planning and design practices, for a given demand level there is a corresponding space requirement. While in practice, there are always trade-offs between cost and levels of service, labor and automation, equipment and fixed facilities, and expansion of existing facilities and the addition of new ones. In this research, the airport passenger Terminal Building (P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012